Protecting Critical Assets: The r-Interdiction Median Problem with Fortification
نویسندگان
چکیده
منابع مشابه
The budget constrained r-interdiction median problem with capacity expansion
In this article, we elaborate on a budget constrained extension of the r -interdiction median problem with fortification (RIMF). The objective in the RIMF is to find the optimal allocation of protection resources to a given service system consisting of p facilities so that the disruptive effects of r possible attacks to the system are minimized. The defender of the system needs to fortify q fac...
متن کاملProtecting critical assets with wireless monitoring
With ever-increasing power demands, electric utilities find themselves in a race to maximize the reliability of their electrical assets while minimizing downtime. As a critical junction point in power distribution, medium-voltage switchgear represents one of the most vulnerable links in the power grid. These valuable assets are subject to overheating due to excessive loads, normal wear and tear...
متن کاملThe r-interdiction median problem with probabilistic protection and its solution algorithm
This paper discusses the critical infrastructure protection problem in supply systems regarding potential intentional attacks. Considering that the protection of a facility cannot be always successful, we present the r-interdiction median problem with probabilistic protection. Defensive resources are allocated according to the degree of importance of service facilities. Computational experiment...
متن کاملProtecting Critical Infrastructure and Key Assets
The Internet is a critical infrastructure and asset in the information age. However, cyber criminals have been using various web-based channels (e.g., email, web sites, Internet newsgroups, and Internet chat rooms) to distribute illegal materials. One common characteristic of these channels is anonymity. Compared with conventional crimes, cybercrime conducted through such anonymous channels imp...
متن کاملThe matching interdiction problem in dendrimers
The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geographical Analysis
سال: 2007
ISSN: 0016-7363,1538-4632
DOI: 10.1111/j.1538-4632.2007.00698.x